翻訳と辞書 |
Uniform binary search : ウィキペディア英語版 | Uniform binary search
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's ''The Art of Computer Programming''. It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a lower bound on each iteration; therefore, it is optimized for architectures (such as Knuth's MIX) on which *a table lookup is generally faster than an addition and a shift, and *many searches will be performed on the same array, or on several arrays of the same length ==C implementation== The uniform binary search algorithm looks like this, when implemented in C.
#define LOG_N 4 static int delta(); void make_delta(int N) int unisearch(int *a, int key) else } } } / * Example of use: */ #define N 10 int main(void)
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Uniform binary search」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|